Higher-Order Orderings for Normal Rewriting
نویسندگان
چکیده
We extend the termination proof methods based on reduction orderings to higher-order rewriting systems using higher-order pattern matching, and accomodate for any use of eta, as a reduction, as an expansion or as an equation.
منابع مشابه
Monomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra
In this paper we consider a free associative algebra on three generators over an arbitrary field K. Given a term ordering on the commutative polynomial ring on three variables over K, we construct uncountably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of...
متن کاملOrderings and Constraints: Theory and Practice of Proving Termination
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand the theory of term orderings to develop powerful and widely applicable methods and on the other hand constraint based techniques to put them in practice. In order to show that this program is realizable a constraint-ba...
متن کاملReduction Orderings and Completion for Rewrite Systems with Binding
We generalise the recursive path ordering (rpo) in order to deal with alpha-equivalence classes of terms, using the nominal approach. We then use the nominal rpo to check termination, and to design a completion procedure, for nominal rewriting systems. Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators — alpha-equivalence is axiom...
متن کاملRewriting Methods for Word Problems
This paper outlines various recent approaches to solving word problems. Term orderings are used to de ne a terminating rewrite relation. When con uent, that relation de nes unique normal forms that can be used to decide word problems. Some results obtained by these methods are summarized.
متن کاملA Termination Ordering for Higher Order Rewrite System
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate the necessary properties of the termination functions for our method to apply, thus describe a class of diierent orderings. We also give a counterexample to a previously published extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006